Computing as Information Compression by Multiple Alignment, Unification and Search
نویسنده
چکیده
This paper argues that the operations of a ‘Universal Turing Machine’ (UTM) and equivalent mechanisms such as the ‘Post Canonical System’ (PCS) which are widely accepted as definitions of the concept of ‘computing’ may be interpreted as information compression by multiple alignment, unification and search (ICMAUS). The motivation for this interpretation is that it suggests ways in which the UTM/PCS model may be augmented in a proposed new computing system designed to exploit the ICMAUS principles as fully as possible. The provision of a relatively sophisticated search mechanism in the proposed ‘SP’ system appears to open the door to the integration and simplification of a range of functions including unsupervised inductive learning, best-match pattern recognition and information retrieval, probabilistic reasoning, planning and problem solving, and others. Detailed consideration of how the ICMAUS principles may be applied to these functions is outside the scope of this article but relevant sources are cited in this article.
منابع مشابه
Computing as Compression by Multiple Alignment, Unification and Search (1) J
This article and its companion17) develop the idea that computing in some deep sense may be understood as a process of information compression by multiple alignment, with a meaning which is close to the meaning of that term in bio-informatics, unification, meaning the merging of two more copies of any pattern to make one, and metrics-guided search. These proposals are the latest phase in a prog...
متن کاملInformation Compression by Multiple Alignment, Unification and Search as a General Theory of Computing
This paper argues that the operation of the ‘Turing machine’, widely regarded as a general model of computing, may be interpreted in terms of information compression by multiple alignment, unification and search. This alternative view of computing, which has potential advantages compared with earlier concepts, may therefore be regarded as a theory of computing which has at least the generality ...
متن کاملMathematics and Logic as Information Compression by Multiple Alignment Unification and Search
This article introduces the conjecture that mathematics, logic and related disciplines may usefully be understood as information compression by ‘multiple alignment’, ‘unification’ and ‘search’. As a preparation for the two main sections of the article, concepts of HartleyShannon information theory and Algorithmic Information Theory are briefly reviewed together with a summary of the essentials ...
متن کاملLogic as Information Compression by Multiple Alignment, Unification and Search
This article considers the proposal that logic may usefully be understood as information compression by multiple alignment, with ‘unification’ and ‘search’, where ‘multiple alignment’ has a meaning which is close to its meaning in bio-informatics, ‘unification’ means a simple merging of matching patterns, and ‘search’ has its normal meaning in the context of computing. A motivation for developi...
متن کاملComputing as Compression by Multiple Alignment, Unification and Search (2) J
This article continues the presentation, begun in the accompanying article,16) of the proposal that computing in some deep sense may be understood as a process of information compression by multiple alignment, unification and metrics-guided search. Examples are presented and discussed to show how this framework of ideas may be applied to such things as pattern recognition, information retrieval...
متن کاملUsing Analogy Discovery to Create Abstractions
ion, Reformulation and Approximation (SARA), 2005. 7. J. G. Wolff. Information compression by multiple alignment, unification and search as a unifying principle in computing and cognition. Artif. Intell. Rev., 2003.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 5 شماره
صفحات -
تاریخ انتشار 1999